Localization, metabelian groups, and the isomorphism problem
نویسندگان
چکیده
منابع مشابه
The Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملDefect Groups and the Isomorphism Problem
As a ring, a block may arise from more than one finite group. The resulting conjugacy issue for defect groups is important for the group ring isomorphism problem and for understanding block theory in general. There are even indirect structural consequences for finite groups, through G. Robinson’s work on the “Z-star theorem” for odd primes. A positive answer to the defect group conjugacy proble...
متن کاملPermutation groups and the graph isomorphism problem
In this article, we discuss various algorithms for permutation group theoretic problems and study its close connection to the graph isomorphism problem. Motivated by this close connection, the last part of this article explores the group representability problem and mention some open problems that arise in this context.
متن کاملOn the Conjugacy Problem in Certain Metabelian Groups
We analyze the computational complexity of the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for some of these groups the conjugacy search problem reduces t...
متن کاملGroups, Graphs, Algorithms: The Graph Isomorphism Problem∗
Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2017
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/6838